首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   857篇
  免费   22篇
  国内免费   49篇
化学   177篇
力学   82篇
综合类   1篇
数学   540篇
物理学   128篇
  2023年   9篇
  2022年   16篇
  2021年   10篇
  2020年   23篇
  2019年   26篇
  2018年   22篇
  2017年   17篇
  2016年   12篇
  2015年   23篇
  2014年   37篇
  2013年   78篇
  2012年   33篇
  2011年   46篇
  2010年   24篇
  2009年   67篇
  2008年   60篇
  2007年   77篇
  2006年   46篇
  2005年   30篇
  2004年   49篇
  2003年   30篇
  2002年   24篇
  2001年   15篇
  2000年   14篇
  1999年   23篇
  1998年   18篇
  1997年   14篇
  1996年   8篇
  1995年   13篇
  1994年   19篇
  1993年   10篇
  1992年   6篇
  1991年   2篇
  1990年   3篇
  1989年   3篇
  1988年   1篇
  1987年   2篇
  1986年   1篇
  1985年   1篇
  1984年   1篇
  1983年   2篇
  1982年   3篇
  1981年   1篇
  1980年   3篇
  1979年   3篇
  1978年   1篇
  1976年   2篇
排序方式: 共有928条查询结果,搜索用时 703 毫秒
1.
2.
Exposure of cimetidine (CIM) to dry heat (160–180 °C) afforded, upon cooling, a glassy solid containing new and hitherto unknown products. The kinetics of this process was studied by a second order chemometrics-assisted multi-spectroscopic approach. Proton and carbon-13 nuclear magnetic resonance (NMR), as well as ultraviolet and infrared spectroscopic data were jointly used, whereas multivariate curve resolution with alternating least squares (MCR-ALS) was employed as the chemometrics method to extract process information. It was established that drug degradation follows a first order kinetics.  相似文献   
3.
4.
基于BDF的无约束优化方法的收敛性分析   总被引:3,自引:0,他引:3  
罗新龙 《计算数学》2003,25(2):177-184
1.介 绍 在上个世纪的七十年代末、八十年代初,基于常微分方程的优化方法或者说同伦方法是一类与拟牛顿法和共轭梯度法等我们所熟知的优化方法相竞争的重要方法[1-6,8,13,14,16].由于这类方法只是简单地利用现成的数值求解常微分方程的软件包,如CVODE[7]、LSODE[12],对同伦方程(一般是一个常微分方程的初值问题)进行计算,除了一些特殊的病态问题  相似文献   
5.
In this paper, the author at first develops a method to study convergence of the cascade algorithm in a Banach space without stable assumption on the initial (see Theorem 2.1), and then applies the previous result on the convergence to characterizing compactly supported refinable distributions in fractional Sobolev spaces and Holder continuous spaces (see Theorems 3.1, 3.3, and 3.4). Finally the author applies the above characterization to choosing appropriate initial to guarantee the convergence of the cascade algorithm (see Theorem 4.2).  相似文献   
6.
Organometallic compounds Cp2TiCl2, (EtC5H4)2NbCl2, and (PriC5H4)2WCl2 were assessed as additives that control polymer chain growth in the polymerization of methyl methacrylate. In the presence of compounds mentioned in amounts comparable with that of the initiator, a uniform process with no gel-effect occured and respective linear increase in the molecular weight of the polymer up to high degrees of the monomer conversion was observed.  相似文献   
7.
Shepherd95 proved that the stable set polytopes of near-bipartite graphs are given by constraints associated with the complete join of antiwebs only. For antiwebs, the facet set reduces to rank constraints associated with single antiwebs by Wagler2004. We extend this result to a larger graph class, the complements of fuzzy circular interval graphs, recently introduced in ChudnovskySeymour2004. Received: November 2004 / Revised version: June 2005  相似文献   
8.
设$p\geq 7$素数,$A$为模$p$的Steenrod代数. 我们利用Adams谱序列证明了球面稳定同伦群$\pi_{\ast}S$中,存在由$b_1g_0\tilde{\gamma}_{s}\in Ext_A^{s+4,(s+1)p^2q+spq+sq+s-3}(Z_p,Z_p)$所表示的新的非平凡元素族,其中$q=2(p-1)$, $3\leq s相似文献   
9.
A stable set of a graph is a vertex set in which any two vertices are not adjacent. It was proven in [A. Brandstädt, V.B. Le, T. Szymczak, The complexity of some problems related to graph 3-colorability, Discrete Appl. Math. 89 (1998) 59-73] that the following problem is NP-complete: Given a bipartite graph G, check whether G has a stable set S such thatG-Sis a tree. In this paper we prove the following problem is polynomially solvable: Given a graph G with maximum degree 3 and containing no vertices of degree 2, check whether G has a stable set S such thatG-Sis a tree. Thus we partly answer a question posed by the authors in the above paper. Moreover, we give some structural characterizations for a graph G with maximum degree 3 that has a stable set S such that G-S is a tree.  相似文献   
10.
In this paper, we investigate the Hausdorff measure for level sets of N-parameter Rd-valued stable processes, and develop a means of seeking the exact Hausdorff measure function for level sets of N-parameter Rd-valued stable processes. We show that the exact Hausdorff measure function of level sets of N-parameter Rd-valued symmetric stable processes of index α is Ф(r) = r^N-d/α (log log l/r)d/α when Nα 〉 d. In addition, we obtain a sharp lower bound for the Hausdorff measure of level sets of general (N, d, α) strictly stable processes.  相似文献   
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号